COMPACT FORMULATION OF MULTICOMMODITY NETWORK FLOWS WITH APPLICATIONS TO THE BACKHAUL PROFIT MAXIMIZATION PROBLEM AND FIXED CHARGE NETWORK FLOW PROBLEM

The triples formulation is a compact formulation of multicommodity network flow problems that provides a different representation of flow than the traditional and widely used node-arc and arc-path approaches. In the literature, the triples formulation has been applied successfully to the maximum concurrent flow problem and to a network optimization problem with piecewise linear convex costs. This dissertation applies the triples formulation to the backhaul profit maximization problem (BPMP) and the fixed charge network flow problem (FCNF). It is shown that the triples representation of multicommodity flow significantly reduces the number of variables and constraints in the mixed integer programming formulations of the BPMP and FCNF. For the BPMP, this results in significantly faster solution times. For dense problem instances, the triples-based formulation of FCNF is found to produce better solutions than the node-arc formulation early in the branch-and-bound process. This observation leads to an effective hybrid method which combines the respective advantages of the smaller size of the triples formulation and the stronger linear programming relaxation of the node-arc formulation. In addition to empirical studies, the dissertation presents new theoretical results supporting the equivalence of the triples formulation to the node-arc and arc-path formulations. The dissertation also proposes a multi-criteria Composite Index Method (CIM) to compare the performance of alternative integer programming formulations of an optimization problem. Using the CIM, the decision maker assigns weights to problem instance sizes and multiple performance measures based on their relative importance for the given application. The weighting scheme is used to produce a single number that measures the relative improvement of one alternative over the other and provides a method to select the most effective approach when neither one dominates the other when tested on different sizes of problem instances. The dissertation demonstrates a successful application of the CIM to evaluate a series of eleven techniques for improving the node-arc and triples formulations of the BPMP previously proposed in the literature

A Composite Index Method for Optimization Benchmarking with Application to the Backhaul Profit Maximization Problem

We propose a multi-criteria Composite Index Method (CIM) to compare the performance of alternative approaches to solving an optimization problem. The CIM is convenient in those situations when neither approach dominates the other when tested on different sizes of problem instances. The CIM takes problem instance size and multiple performance criteria into consideration within a weighting scheme to produce a single number that measures the relative improvement of one alternative over the other. Different weights are given to each dimension based on their relative importance as determined by the end user. We summarize the successful application of the CIM to an NP-hard combinatorial optimization problem known as the backhaul profit maximization problem (BPMP). Using the CIM we tested a series of eleven techniques for improving solution time using CPLEX to solve two different BPMP models proposed in the literature

Characterizing and Predicting Early Reviewers for Effective Product Marketing on E-Commerce Websites

Online reviews have become an important source of information for users before making an informed purchase decision. Early reviews of a product tend to have a high impact on the subsequent product sales. In this paper, we take the initiative to study the behavior characteristics of early reviewers through their posted reviews on two real-world large e-commerce platforms, i.e., Amazon and Yelp. In specific, we divide product lifetime into three consecutive stages, namely early, majority and laggards. A user who has posted a review in the early stage is considered as an early reviewer. We quantitatively characterize early reviewers based on their rating behaviors, the helpfulness scores received from others and the correlation of their reviews with product popularity. We have found that (1) an early reviewer tends to assign a higher average rating score; and (2) an early reviewer tends to post more helpful reviews. Our analysis of product reviews also indicates that early reviewers' ratings and their received helpfulness scores are likely to influence product popularity. By viewing review posting process as a multiplayer competition game, we propose a novel margin-based embedding model for early reviewer prediction. Extensive experiments on two different e-commerce datasets have shown that our proposed approach outperforms a number of competitive baselines

The prognostic value of whole-genome DNA methylation in response to Leflunomide in patients with Rheumatoid Arthritis

ObjectiveAlthough Leflunomide (LEF) is effective in treating rheumatoid arthritis (RA), there are still a considerable number of patients who respond poorly to LEF treatment. Till date, few LEF efficacy-predicting biomarkers have been identified. Herein, we explored and developed a DNA methylation-based predictive model for LEF-treated RA patient prognosis.MethodsTwo hundred forty-five RA patients were prospectively enrolled from four participating study centers. A whole-genome DNA methylation profiling was conducted to identify LEF-related response signatures via comparison of 40 samples using Illumina 850k methylation arrays. Furthermore, differentially methylated positions (DMPs) were validated in the 245 RA patients using a targeted bisulfite sequencing assay. Lastly, prognostic models were developed, which included clinical characteristics and DMPs scores, for the prediction of LEF treatment response using machine learning algorithms.ResultsWe recognized a seven-DMP signature consisting of cg17330251, cg19814518, cg20124410, cg21109666, cg22572476, cg23403192, and cg24432675, which was effective in predicting RA patient’s LEF response status. In the five machine learning algorithms, the support vector machine (SVM) algorithm provided the best predictive model, with the largest discriminative ability, accuracy, and stability. Lastly, the AUC of the complex model(the 7-DMP scores with the lymphocyte and the diagnostic age) was higher than the simple model (the seven-DMP signature, AUC:0.74 vs 0.73 in the test set).ConclusionIn conclusion, we constructed a prognostic model integrating a 7-DMP scores with the clinical patient profile to predict responses to LEF treatment. Our model will be able to effectively guide clinicians in determining whether a patient is LEF treatment sensitive or not

A heterozygous moth genome provides insights into herbivory and detoxification

How an insect evolves to become a successful herbivore is of profound biological and practical importance. Herbivores are often adapted to feed on a specific group of evolutionarily and biochemically related host plants1, but the genetic and molecular bases for adaptation to plant defense compounds remain poorly understood2. We report the first whole-genome sequence of a basal lepidopteran species, Plutella xylostella, which contains 18,071 protein-coding and 1,412 unique genes with an expansion of gene families associated with perception and the detoxification of plant defense compounds. A recent expansion of retrotransposons near detoxification-related genes and a wider system used in the metabolism of plant defense compounds are shown to also be involved in the development of insecticide resistance. This work shows the genetic and molecular bases for the evolutionary success of this worldwide herbivore and offers wider insights into insect adaptation to plant feeding, as well as opening avenues for more sustainable pest management.Minsheng You … Simon W Baxter … et al

An Empirical Study of Mixed Integer Programming Formulations of the Backhaul Profit Maximization Problem

Solving an instance of the Backhaul Profit Maximization Problem (BPMP) requires simultaneously solving two problems: (1) determining how to route an empty delivery vehicle back from its current location to its depot by a scheduled arrival time, and (2) selecting a profit-maximizing subset of delivery requests between various locations on the route subject to the vehicle\u27s capacity. We propose and test a series of enhancements to the node-arc and triples mixed integer programming formulations of BPMP found in the literature and develop a multi-criteria Composite Index Method (CIM) to evaluate the results. We find that CPLEX takes 5 to 34 minutes (real time) to solve BPMP instances from the literature with 20 potential pickup/drop-off locations using the original node-arc model on the computers in our lab. Applying our own insights and adapting techniques from the literature on related problems, we develop an enhanced node-arc formulation that reduces the range of solution times of the 20-location instances to 31 to 105 seconds. Additionally, we solve problem instances that are twice as large (40 locations) as those solved in the literature. With the triples formulation from the literature, we find that the 20-location instances take between 2 to 21 seconds to solve. Using our enhanced triples formulation, however, we solve these same instances in six seconds or less. Comparing our two enhanced formulations, we solve 40-location instances in an average of 7 minutes with the enhanced triples formulation compared to an average of 92 hours with the enhanced node-arc formulation. Additionally, we find that the average time to solve 50-node instances with the enhanced triples formulation is 36 minutes

Hydrogen Reduction: A Novel Method of Synthesizing Ultra-fine Chromic Oxide Powder

The ultra-fine chromic oxide powder was prepared by a novel gas-solid reduction reaction. Na(2)CrO(4) was firstly reduced with hydrogen at 400-600 degrees C The obtained reduction products, mainly the mixture of NaCrO(2) and sodium hydroxide (NaOH), were converted into chromic oxide through hydrolysis followed by calcination. The obtained chromic oxide product was characterized by powder X-ray diffraction (XRD) and SEM. The results show that the hydrolysis process of sodium chromite is the key step and lower reduction temperature helps intensify the hydrolysis process

Synthesis and Characterization of Ultra-fine Cr2O3 from Hydrogen Reduction of K2CrO4

As a part of the green process for manufacturing chromium compounds, two steps are involved in the synthesis of ultra-fine Cr2O3 powders： the first is the hydrogen reduction of K2CrO4 into intermediate trivalent （Cr^3＋） or tetravalent （Cr^4＋） chromium compounds; the second is the decomposing of the intermediate into Cr2O3 by heat treating. The intermediate is well characterized by means of SEM, XRD, and XPS. The possible reaction mechanism of the process is analyzed